Quantum Computing Overview

Principles

Definition

Quantum computing is a multidisciplinary field of research dedicated to designing and building computing systems that harness the principles of quantum mechanics, such as superposition and entanglement, to perform calculations potentially intractable for classical computers, offering transformative capabilities across various domains.

Ontological type

Quantum Algorithms

Core Principles

Practical Applications

Key developments

Key Figures

Foundations and Primitives era

Charles H. Bennett [1], associated with Harvard University [3] and the Massachusetts Institute of Technology [4], played a pivotal role in articulating quantum information primitives during the Foundations and Primitives era. His landmark paper Teleporting an unknown quantum state via dual classical and Einstein-Podolsky-Rosen channels [7] introduced the quantum teleportation protocol, demonstrating that entanglement plus classical communication can faithfully transmit quantum states, a foundational primitive for quantum information processing. William K. Wootters [2], affiliated with University of Pennsylvania [5] and the University of California, Los Angeles [6], contributed alongside Bennett to this era's core ideas by co-authoring the teleportation work and clarifying how entanglement can enable nonlocal state transfer via the teleportation paper [7]. For William K. Wootters [2], this collaboration, the teleportation paper [7], established a practical blueprint for entanglement-based quantum communication during this era, linking abstract limits to experimental architectures and foreshadowing photonic implementations and error-correction concepts.

Architectures and Fault Tolerance era

Peter W. Shor [1] is associated with MIT [3] and California Institute of Technology [4] during the Architectures and Fault Tolerance era (2001–2011). The 2002 paper Algorithms for quantum computation: discrete logarithms and factoring [7] by Shor [1] introduced efficient quantum algorithms for factoring and discrete logarithms, highlighting potential speedups and motivating early considerations of fault-tolerant, scalable architectures. S. Das Sarma [2] is linked with the University of Science and Technology of China [5] and Columbia University [6] during this era. His 2008 paper Non-Abelian anyons and topological quantum computation [8] outlined a topological approach to quantum computation with non-Abelian anyons, a framework celebrated for intrinsic fault tolerance and informing architecture-level design in quantum platforms.

Hybrid Engineering and Scaling era

Jay Gambetta [1] is a leading quantum computing researcher whose work in the Hybrid Engineering and Scaling era has included collaborations with and contributions from institutions such as the University of Waterloo [3]. Gambetta [1] contributed to advancing hardware-efficient variational quantum eigensolvers for small molecules and quantum magnets [4], a development that made quantum chemistry experiments feasible on noisy intermediate-scale devices and underscored hardware-aware algorithm design as essential in this era. Jerry M. Chow [2] has been active across this era, including collaborations with groups at University of Waterloo [3], reflecting the era's emphasis on cross-institutional collaboration in scaling quantum systems. Chow [2] is a co-author of the hardware-efficient variational quantum eigensolver paper [4], and this contribution helped validate hardware-aware approaches that enable practical quantum chemistry on near-term devices.